A Characterization of Visibility Graphs for Pseudo-polygons
نویسندگان
چکیده
In this paper, we give a characterization of the visibility graphs of pseudo-polygons. We first identify some key combinatorial properties of pseudo-polygons, and we then give a set of five necessary conditions based off our identified properties. We then prove that these necessary conditions are also sufficient via a reduction to a characterization of vertex-edge visibility graphs given by O’Rourke and Streinu.
منابع مشابه
Non-stretchable pseudo-visibility graphs
We exhibit a family of graphs which can be realized as pseudo-visibility graphs of pseudo-polygons, but not of straight-line polygons. The example is based on the characterization of vertex-edge pseudo-visibility graphs of O’Rourke and Streinu [Proc. ACM Symp. Comput. Geometry, Nice, France, 1997, pp. 119–128] and extends a recent result of the author [Proc. ACM Symp. Comput. Geometry, Miami Be...
متن کاملVisibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains
The recognition problem for visibility graphs of simple polygons is not known to be in NP, nor is it known to be NP-hard. It is, however, known to be in PSPACE. Further, every such visibility graph can be dismantled as a sequence of visibility graphs of convex fans. Any nondegenerate configuration of n points can be associated with a maximal chain in the weak Bruhat order of the symmetric group...
متن کاملPoint Visibility Graphs and O-Convex Cover
A visibility relation can be viewed as a graph: the uncountable graph of a visibility relationship between points in a polygon P is called the point visibility graph (PVG) of P. In this paper we explore the use of perfect graphs to characterize tractable subprob-lems of visibility problems. Our main result is a characterization of which polygons are guaranteed to have weakly triangulated PVGs, ...
متن کاملA Note on the Combinatorial Structure of the Visibility Graph in Simple Polygons
Combinatorial structure of visibility is probably one of the most fascinating and interesting areas of engineering and computer science. The usefulness of visibility graphs in computational geometry and robotic navigation problems like motion planning, unknown-terrain learning, shortest-path planning, etc., cannot be overstressed. The visibility graph, apart from being an important data structu...
متن کاملMAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
In an alternative approach to “characterizing” the graph class of visibility graphs of simple polygons, we study the problem of finding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maximum clique problem on general graphs implies that n...
متن کامل